An Efficient Public Key Encryption Scheme Using Shared Secrets
نویسنده
چکیده
This paper describes the combination of Shamir secret sharing method with the trap door characteristics of discrete logarithm mod a large prime number as employed in the Diffie-Hellman exchange scheme. The purpose of this combination is to protect the privacy of the numbers held by the parties of the shared secret, while at the same time authorizing them to broadcast data in the clear which when published by adequate of the parties enables authorization of the transaction for instance t out of n signers for the cheque.
منابع مشابه
An efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملA Comprehensive Cloud Security Model with Enhanced Key Management, Access Control and Data Anonymization Features
A disgusting problem in public cloud is to securely share data based on fine grained access control policies and unauthorized key management. Existing approaches to encrypt policies and data with different keys based on public key cryptosystem are Attribute Based Encryption and proxy reencryption. The weakness behind approaches is: It cannot efficiently handle policy changes and also problem in...
متن کاملVerifiable (t, n) Threshold Secret Sharing Scheme Using ECC Based Signcryption
In this paper, a secured (t, n) threshold secret sharing scheme has been proposed which prevents cheating from participants as well as from trusted dealer (TD) (which distributes shared secrets and reconstructs shared secret key). Here, a signcryption scheme based on elliptic curve cryptography (ECC ) which incorporates both the digital signature and encryption scheme in a single logical step i...
متن کاملFully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic scheme from a “somewhat” homomorphic scheme. For the somewhat homomorphic scheme the public and private keys consist of two large integers (one of which is shared by both the public and private key) and the ciphertext ...
متن کاملLecture 8 : Public - Key Encryption
In the previous lecture, we discussed the concept of Secret-Key Encryption. However, this scheme has a major limitation in the fact that the key has to be shared between the sender and the receiver before any message can be transmitted. There might be several cases where doing this is infeasible if there has been no prior communication between the sender and the receiver. In today’s lecture, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015